By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 29, Issue 3, pp. 697-1049

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Angular-Metric Traveling Salesman Problem

Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, and Baruch Schieber

pp. 697-711

BibTeX  Abstract Full Text:  PDF

On Learning Functions from Noise-Free and Noisy Samples via Occam's Razor

B. Natarajan

pp. 712-727

BibTeX  Abstract Full Text:  PDF

Navigation in Hypertext Is Easy Only Sometimes

Mark Levene and George Loizou

pp. 728-760

BibTeX  Abstract Full Text:  PDF

A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, and Chuan Yi Tang

pp. 761-778

BibTeX  Abstract Full Text:  PDF

Complexity of Deciding Sense of Direction

Paolo Boldi and Sebastiano Vigna

pp. 779-789

BibTeX  Abstract Full Text:  PDF

Rigorous Time/Space Trade-offs for Inverting Functions

Amos Fiat and Moni Naor

pp. 790-803

BibTeX  Abstract Full Text:  PDF

Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks

Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, and David Peleg

pp. 804-833

BibTeX  Abstract Full Text:  PDF

Randomly Sampling Molecules

Leslie Ann Goldberg and Mark Jerrum

pp. 834-853

BibTeX  Abstract Full Text:  PDF

Computational Sample Complexity

Scott E. Decatur, Oded Goldreich, and Dana Ron

pp. 854-879

BibTeX  Abstract Full Text:  PDF

A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

Haim Kaplan, Ron Shamir, and Robert E. Tarjan

pp. 880-892

BibTeX  Abstract Full Text:  PDF

Compression of Low Entropy Strings with Lempel--Ziv Algorithms

S. Rao Kosaraju and Giovanni Manzini

pp. 893-911

BibTeX  Abstract Full Text:  PDF

Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications

Pankaj K. Agarwal, Alon Efrat, and Micha Sharir

pp. 912-953

BibTeX  Abstract Full Text:  PDF

\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring

Z. Sweedyk

pp. 954-986

BibTeX  Abstract Full Text:  PDF

On the Structure of Logspace Probabilistic Complexity Classes

Ioan I. Macarie

pp. 987-1007

BibTeX  Abstract Full Text:  PDF

Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem

F. K. Miyazawa and Y. Wakabayashi

pp. 1008-1029

BibTeX  Abstract Full Text:  PDF

Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree

Dan E. Willard

pp. 1030-1049

BibTeX  Abstract Full Text:  PDF